On inducing polygons and related problems
نویسندگان
چکیده
منابع مشابه
On Inducing Polygons and Related Problems
Bose et al. [1] asked whether for every simple arrangement A of n lines in the plane there exists a simple n-gon P that induces A by extending every edge of P into a line. We prove that such a polygon always exists and can be found in O(n log n) time. In fact, we show that every finite family of curves C such that every two curves intersect at least once and finitely many times and no three cur...
متن کاملInducing Polygons of Line Arrangements
We show that an arrangement A of n lines in general position in the plane has an inducing polygon of size O(n). Additionally, we present a simple algorithm for finding an inducing n-path for A in O(n log n) time and an algorithm that constructs an inducing n-gon for a special class of line arrangements within the same time bound. Eligible for best student paper
متن کاملIsodiametric Problems for Polygons
The maximal area of a polygon with n = 2m edges and unit diameter is not known when m ≥ 5, nor is the maximal perimeter of a convex polygon with n = 2m edges and unit diameter known when m ≥ 4. We construct improved polygons in both problems, and show that the values we obtain cannot be improved for large n by more than c1/n in the area problem and c2/n in the perimeter problem, for certain con...
متن کاملglobal results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
Extremal problems for convex polygons
Consider a convex polygon Vn with n sides, perimeter Pn, diameter Dn, area An, sum of distances between vertices Sn and widthWn. Minimizing or maximizing any of these quantities while fixing another defines ten pairs of extremal polygon problems (one of which usually has a trivial solution or no solution at all). We survey research on these problems, which uses geometrical reasoning increasingl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2013
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2011.06.003